Geometrical Complexity Extraction from Visualized Image
نویسندگان
چکیده
منابع مشابه
Complexity-scalable compensation of geometrical distortions in image watermarking
Geometrical transformations are one of the most important issues to be solved to increase the robustness of digital image watermarking systems. This paper presents an efficient method for inverting geometrical distortions that may spatially desynchronise a watermark detector. We propose a strategy that is scalable in transform complexity, since in some cases a simple transformation is sufficien...
متن کاملGeometrical parameters extraction from discrete paths
We present in this paper the advantages of using the model of Euclidean paths for the geometrical analysis of a discrete curve. The Euclidean paths are a semi-continuous representation of a discrete path providing a good approximation of the underlying real curve. We describe the use of this model to obtain accurate estimations of lenght, tangent orientation and curvature.
متن کاملGeometrical Endmember Extraction and Linear Spectral Unmixing of Multispectral Image
Accurate mapping is prepared using Linear unmixing of satellite images. Endmember extraction contributes the unmixing accuracy. In this paper, Endmembers are extracted using different Geometrical algorithms like Pixel Purity Index (PPI), Nearest Finder (N-FINDR) and Sequential Maximum Angle Convex Cone (SMACC) algorithms. Extracted Endmembers are given as input for unmixing and it is attempted ...
متن کاملGeometrical Complexity of Classification Problems
Despite encouraging recent progresses in ensemble approaches, classification methods seem to have reached a plateau in development. Further advances depend on a better understanding of geometrical and topological characteristics of point sets in high-dimensional spaces, the preservation of such characteristics under feature transformations and sampling processes, and their interaction with geom...
متن کاملGeometrical Complexity of Data Approximators
There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types of principal curves and principal trees, and so on. For each type of approximators the measure of the approximator complexity was developed too. These measure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Visualization Society of Japan
سال: 2005
ISSN: 1884-037X,0916-4731
DOI: 10.3154/jvs.25.supplement1_67